Reachability Analysis of Timed Transition Systemsbased on Constraint

Transition systems with timing constraints are a well known abstract representation of real time systems. EEcient analysis of timed transition systems is therefore a basis for real time veriication. In this paper we introduce an algorithm for reachability analysis of timed transition systems with forced events which is based on an intuitive concept of constraint evaluation. During a depth-rst search, the possible next states of each considered path are found by determining all transitions which are not in contradiction to the current timing constraints. The timing information is captured in a concise matrix representation for which a normal form is deened to guarantee the termination and improve the eeciency of the algorithm .